Detailed Proof of Theorem 4.1 in Sense and Denotation as Algorithm and Value

A Note on the Descent Property Theorem for the Hybrid Conjugate Gradient Algorithm CCOMB Proposed by Andrei

In [1] (Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization J. Optimization. Theory Appl. 141 (2009) 249 - 264), an efficient hybrid conjugate gradient algorithm, the CCOMB algorithm is proposed for solving unconstrained optimization problems. However, the proof of Theorem 2.1 in [1] is incorrect due to an erroneous inequality which used to indicate the descent property for the s...

On the norm of the derived‎ subgroups of all subgroups of a finite group

In this paper‎, ‎we give a complete proof of Theorem 4.1(ii) and a new‎ ‎elementary proof of Theorem 4.1(i) in [Li and Shen‎, ‎On the‎ ‎intersection of the normalizers of the derived subgroups of all‎ ‎subgroups of a finite group‎, ‎ J‎. ‎Algebra, ‎323  (2010) 1349--1357]‎. ‎In addition‎, ‎we also give a generalization of Baer's Theorem‎.

Sense and denotation as algorithm and value

In his classic 1892 paper On sense and denotation [12], Frege first contends that in addition to their denotation (reference, Bedeutung), proper names also have a sense (Sinn) “wherein the mode of presentation [of the denotation] is contained.” Here proper names include common nouns like “the earth” or “Odysseus” and descriptive phrases like “the point of intersection of lines L1 and L2” which ...

A new proof for the Banach-Zarecki theorem: A light on integrability and continuity

To demonstrate more visibly the close relation between thecontinuity and integrability, a new proof for the Banach-Zareckitheorem is presented on the basis of the Radon-Nikodym theoremwhich emphasizes on measure-type properties of the Lebesgueintegral. The Banach-Zarecki theorem says that a real-valuedfunction $F$ is absolutely continuous on a finite closed intervalif and only if it is continuo...

Sense and Denotation as Algorithm and Value